A Distributed Algorithm as Mobile Agents

We present a technique for mapping a theoretical distributed algorithm to a set of homogeneous agents that solves the general distributed control problem know as election. Election is a decentralized, cooperative information task where one system or node from n is elected as the leader. Our solution is as efficient as the theoretical election distributed algorithm, but does not rely on message passing between custom protocols located on communicating systems. Rather, the proposed solution relies on mobile agents. We show that the number of agent transfers is equivalent to the number of messages in the original theoretical distributed algorithm. We also present an environment model for distributed agents that supports not only the mapping of election agents but other agent-based solution to distributed control problems that use theoretical distributed algorithms.